The synchronized multi-assignment orienteering problem

We introduce the Synchronized Multi-Assignment Orienteering Problem (SMOP), a vehicle routing problem that requires jointly selecting set of jobs while synchronizing assignment and transportation agents to roles form ad-hoc teams at different job locations. Agents must be assigned only for which they are qualified. Each certain number in each role within time window contributes reward score if selected. The task is maximize total attained. SMOP can model many real-world scenarios requiring coordinated resources accommodates traditional depot-based workforces, depot workforces supplemented by workers, fully alike. same formulation used initial planning mid-course replanning. develop mixed integer programming (MIP) an Adaptive Large Neighborhood Search algorithm (ALNS). In computational experiments covering range considerations, ALNS consistently found very near-optimal solutions on smaller problems surpassed commercial MIP solver substantially larger problems. also 24 new best benchmark from literature related Cooperative with Time Windows.